Graph reliability evaluation via random <i>K</i>-out-of-<i>N</i> systems

نویسندگان

چکیده

The present study was concerned with network failure problems for simple connected undirected graphs. A graph becomes unconnected through edge failure, under the assumptions that only edges can fail and each has an identical distribution. main purpose of to show recurrent relations respect number in generation procedures. To this end, graphs were correlated random K-out-of-N systems, key features such systems applied. In addition, some cases examples analyzed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Joint Reliability Importance for k-out-of-n Systems

‎In this paper‎, ‎the concept of joint reliability importance (JRI) of two or groups of components in a coherent system with independent components have been studied‎. ‎The JRI is defined as the rate at which the system reliability improves as the reliabilities‎ ‎of the two or groups of components improve‎. ‎Generally‎, ‎the sign and the value of the JRI represent the type and the‎ ‎degree of i...

متن کامل

Random Graph Directed Markov Systems

We introduce and explore random conformal graph directed Markov systems governed by measure-preserving ergodic dynamical systems. We first develop the symbolic thermodynamic formalism for random finitely primitive subshifts of finite type with a countable alphabet (by establishing tightness in a narrow topology). We then construct fibrewise conformal and invariant measures along with fibrewise ...

متن کامل

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

15 صفحه اول

Graph Model Selection via Random Walks

In this paper, we present a novel approach based on the random walk process for finding meaningful representations of a graph model. Our approach leverages the transient behavior of many short random walks with novel initialization mechanisms to generate model discriminative features. These features are able to capture a more comprehensive structural signature of the underlying graph model. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Statistics

سال: 2022

ISSN: ['1532-415X', '0361-0926']

DOI: https://doi.org/10.1080/03610926.2022.2099897